Sequence Programming with Dynamic Boronic Acid/Catechol Binary Codes

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

The generic Huffman-Encoding Problem of finding a minimum cost prefix-free code is almost completely understood. There still exist many variants of this problem which are not as well understood, though. One such variant, requiring that each of the codewords ends with a “1,” has recently been introduced in the literature with the best algorithms known for finding such codes running in exponentia...

Sequence Similarity and Dynamic Programming

Dynamic programming is a classic programming technique, applicable in a wide variety of domains, like stochastic systems analysis, operations research, combinatorics of discrete structures, flow problems, parsing with ambiguous grammars, or biosequence analysis. Yet, no methodology is available for designing such algorithms. The matrix recurrences that typically describe a dynamic programming a...

Binary Codes with Inner

In this paper synchronous DS-CDMA with binary block coding is investigated for AWGN. First the asymptotic behaviour for coded transmission is derived for the optimal decoder. This order is called the asymptotic distance. Upper and lower bounds for the asymptotic distance are given for a K user system. For K = 2 the asymptotic distance is calculated exactly.Then it is shown how the asymptotic be...

Mathematical Programming Approaches for Decoding of Binary Linear Codes

A Dynamic Programming Approach to Generating a Binary Reflected Gray Code Sequence

A binary reflected Gray code (Gray code for short) is a one-to-one function G(i) of the integers 0 • i • 2 – 1 (for some pre-selected value of n) to binary numbers such that the binary number for G(i) and G(i+1) differ in exactly one bit. For example, with N = 3, the Gray codes (written in binary) are 000, 001, 011, 010, 110, 111, 101, 100. In this paper, we describe a dynamic programming algor...